On the Erasure Recoverabi under Concurrent
نویسندگان
چکیده
We consider a fault-tolerant distributed storage system that protects data on k disks using a systematic linear (n, k) MDS code. In such a system, updates to data blocks require corresponding updates to check blocks. Concurrent fault-prone access by multiple writers can drive the system into an inconsistent state with reduced tolerance for disk failures. We show tight bounds on the erasure recoverability of an (n, k) MDS code in this scenario. The bounds depend not just on the minimum distance of the code, but also on the maximum number of concurrent faulty writers and the manner in which they attempt to update the check blocks (one at a time/all at once.)
منابع مشابه
ظرفیت شبکه های حذفی تحت کدینگ فضایی شبکه
We study the capacity of point-to-point erasure networks under a restricted form of network coding to which we refer as spatial network coding. In this form of coding, the nodes can not perform coding on successive packets which are received from one incoming link. The coding at a node is restricted to the packets received at the same time slot from different incoming links...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملDEICS: Data Erasure in Concurrent Software
A well known tenet for ensuring unauthorized leaks of sensitive data such as passwords and cryptographic keys is to erase (”zeroize”) them after their intended use in any program. Prior work on minimizing sensitive data lifetimes has focused exclusively on sequential programs. In this work, we address the problem of data lifetime minimization for concurrent programs. We develop a new algorithm ...
متن کاملFluidity Onset Analysis in FG Thick-Walled Spherical Tanks under Concurrent Pressure Loading and Heat Gradient
In this paper,fluidity onset analysis in FG thick-walled spherical tanks under concurrent pressure loading and heat gradient has been presented. Designing thick-walled spherical tanks under pressure as tanks holding fluids under heat loads with high heat gradients require new approaches. Under high internal pressure and high temperature, the tank enters the plastic stage in a part of its thickn...
متن کاملA Layered Architecture for Erasure-Coded Consistent Distributed Storage
Motivated by emerging applications to the edge computing paradigm, we introduce a two-layer erasure-coded fault-tolerant distributed storage system offering atomic access for read and write operations. In edge computing, clients interact with an edge-layer of servers that is geographically near; the edge-layer in turn interacts with a back-end layer of servers. The edge-layer provides low laten...
متن کامل